Jérôme Leroux Least Significant Digit First
نویسنده
چکیده
منابع مشابه
Structural Presburger digit vector automata
The least significant digit first decomposition of integer vectors into words of digit vectors provides a natural way for representing sets of integer vectors by automata. In this paper, the minimal automata representing Presburger sets are proved structurally Presburger: automata obtained by moving the initial state and replacing the accepting condition represent Presburger sets.
متن کاملThe convex hull of a regular set of integer vectors is polyhedral and effectively computable
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors represented by a NDD is proved to be an effectively computable convex polyhedron.
متن کاملThe convex hull of a regular set of integer vec - tors is polyhedral and effectively computable Alain Finkel
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors represented by a NDD is proved to be an effectively computable convex polyhedron.
متن کاملA Polynomial Time Presburger Criterion and Synthesis
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significant digit first). Since 1969 [9, 29], we know that any Presburger-definable set [26] (a set of integer vectors satisfying a formula in the first-order additive theory of the integers) can be represented by a NDD, and eff...
متن کاملLeast Significant Digit First Presburger Automata
1 Introduction Presburger arithmetic [Pre29] is a decidable logic used in a large range of applications. As described in [Lat04], this logic is central in many areas including integer programming problems [Sch87], compiler optimization techniques [Ome], program analysis tools [BGP99, FO97, Fri00] and model-checking [BFL04, Fas, Las]. Different techniques [GBD02] and tools have been developed fo...
متن کامل